Expressiveness of Process Algebras

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressiveness of Process Algebras

We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.

متن کامل

Read Operators and their Expressiveness in Process Algebras

We study two different ways to enhance PAFAS, a process algebra for modelling asynchronous timed concurrent systems, with non-blocking reading actions. We first add reading in the form of a readaction prefix operator. This operator is very flexible, but its somewhat complex semantics requires two types of transition relations. We also present a read-set prefix operator with a simpler semantics,...

متن کامل

amenability of banach algebras

chapters 1 and 2 establish the basic theory of amenability of topological groups and amenability of banach algebras. also we prove that. if g is a topological group, then r (wluc (g)) (resp. r (luc (g))) if and only if there exists a mean m on wluc (g) (resp. luc (g)) such that for every wluc (g) (resp. every luc (g)) and every element d of a dense subset d od g, m (r)m (f) holds. chapter 3 inv...

15 صفحه اول

RAPPORT Expressiveness results for process

The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an eeective operational semantics is introduced and it is observed that no eeective operational semantics for an enumerable language can specify all eeective process graphs up to trace equivalence. A natural class of Plotkin style SOS speciications is identiied, conta...

متن کامل

The Expressiveness of Generic Process Shape Types

META✶ is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the π-calculus, the system of Mobile Ambients, and many of their variants. POLY✶ is a generic type system that makes a sound type system with principal types and a type inference algorithm for any instantiation of META✶. POLY✶ provi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2008

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2008.04.011